منابع مشابه
Geographic routing in social networks.
We live in a "small world," where two arbitrary people are likely connected by a short chain of intermediate friends. With scant information about a target individual, people can successively forward a message along such a chain. Experimental studies have verified this property in real social networks, and theoretical models have been advanced to explain it. However, existing theoretical models...
متن کاملTheoretical Analysis of Geographic Routing in Social Networks
We introduce a formal model for geographic social networks, and introduce the notion of rank-based friendship, in which the probability that a person v is a friend of a person u is inversely proportional to the number of people w who live closer to u than v does. We then prove our main theorem, showing that rank-based friendship is a sufficient explanation of the navigability of any geographic ...
متن کاملSecuring Geographic Routing in Wireless Sensor Networks
We consider the security of geographic routing (GR) that is widely used in ad hoc and wireless sensor networks due to its scalability. In GR, a node greedily forwards a packet to the neighbor that is closest to the destination. Thus, GR only requires a node to maintain the location information of its one hop neighbors. However, very little work has been done to secure GR. In a potential attack,...
متن کاملNon-Euclidian geographic routing in wireless networks
Greedy geographic routing is attractive for large multi-hop wireless networks because of its simple and distributed operation. However, it may easily result in dead ends or hotspots when routing in a network with obstacles (regions without sufficient connectivity to forward messages). In this paper we propose a distributed routing algorithm that combines greedy geographic routing with two non-E...
متن کاملSelfish Routing in Social Networks
I investigate the intersection of selfish routing and the preferential attachment social network. In particular, through the use of a stochastic generative preferential attachment model, a collection abstract network patterns are created for the transfer of flow from one distinct source destination vertex pair. Then, using a linear approximation method, I calculate both Nash and system optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2005
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0503018102